High performance computing applied to competitive facility location and design problems: single and multi-objective optimization algorithms
نویسندگان
چکیده
High performance computing applied to competitive facility location and design problems: single and multi-objective optimization algorithms A mis padres, a mi hermano y a Manu Agradecimientos En primer lugar me gustaría agradecer a mis tres supervisores, Dra. D Prefacio La localización de servicios pretende encontrar el emplazamiento de uno o más centros Esta tesis, " High performance computing applied to competitive facility location and design problems: single and multi-objective optimization algorithms " Preface Facility location applications are concerned with the location of one or more facilities in a way that optimizes one or several objectives at the same time, such as minimizing transportation costs, providing equitable service to customers, capturing the largest market share, etc. The research on facility location problems spans many research fields such as operations research/management science, industrial engineering, geography , economics, computer science, mathematics, marketing, urban planning, and the corresponding related fields. There exist many facility location problems in real life, for example location of hospitals , schools or rubbish dumps, to name a few. Nevertheless, to be able to obtain certain solutions to location problems, it is necessary to describe them as close to reality as possible, which may result in hard-to-solve optimization models. Many global optimization algorithms, either exact or heuristic, have flourished to cope with location problems. However, exact algorithms are unable to solve some problems, because they are too slow or the computer runs out of memory. Thus, heuristic procedures have to be developed to solve those other difficult problems. Nevertheless, sometimes, computational requirements are so high that the use of heuristic algorithms running in standard computers is not enough. In such situations, high performance computing is needed. This thesis, " High performance computing applied to competitive facility location and design problems: single and multi-objective optimization algorithms " , provides, on the one hand, heuristic algorithms able to solve single and multi-objective competitive continuous location problems and, on the other hand, parallel techniques which reduce the execution time, allow to solve larger problems and, in some cases, improve the quality of the solutions. This thesis is organized in four chapters. The first one is an introduction to the three main research areas involved in this thesis, i.e., location science, search algorithms and high performance computing. Chapter 1 begins with a brief description of the main elements of a location problem. Then, the definition of global optimization and non-linear multi-objective optimization problems is …
منابع مشابه
Parallel Shared-Memory Multi-Objective Stochastic Search for Competitive Facility Location
A stochastic search algorithm for local multi-objective optimization is developed and applied to solve a multi-objective competitive facility problem for firm expansion using shared-memory parallel computing systems. The performance of the developed algorithm is experimentally investigated by solving competitive facility location problems, using up to 16 shared-memory processing units. It is sh...
متن کاملSolving a bi-objective location routing problem by a NSGA-II combined with clustering approach: application in waste collection problem
It is observed that the separated design of location for depots and routing for servicing customers often reach a suboptimal solution. So, solving location and routing problem simultaneously could achieve better results. In this paper, waste collection problem is considered with regard to economic and societal objective functions. A non-dominated sorting genetic algorithm (NSGA-II) is used to l...
متن کاملApplications of two new algorithms of cuckoo optimization (CO) and forest optimization (FO) for solving single row facility layout problem (SRFLP)
Nowadays, due to inherent complexity of real optimization problems, it has always been a challenging issue to develop a solution algorithm to these problems. Single row facility layout problem (SRFLP) is a NP-hard problem of arranging a number of rectangular facilities with varying length on one side of a straight line with aim of minimizing the weighted sum of the distance between all facility...
متن کاملOPTIMAL DESIGN OF TRUSS STRUCTURES BY IMPROVED MULTI-OBJECTIVE FIREFLY AND BAT ALGORITHMS
The main aim of the present paper is to propose efficient multi-objective optimization algorithms (MOOAs) to tackle truss structure optimization problems. The proposed meta-heuristic algorithms are based on the firefly algorithm (FA) and bat algorithm (BA), which have been recently developed for single-objective optimization. In order to produce a well distributed Pareto front, some improvement...
متن کاملEfficiency of a multi-objective imperialist competitive algorithm: A bi-objective location-routing-inventory problem with probabilistic routes
An integrated model considers all parameters and elements of different deficiencies in one problem. This paper presents a new integrated model of a supply chain that simultaneously considers facility location, vehicle routing and inventory control problems as well as their interactions in one problem, called location-routing-inventory (LRI) problem. This model also considers stochastic demands ...
متن کامل